A Tutorial on St Almarck's Proof Procedure for Propositional Logic a Tutorial on St Almarck's Proof Procedure for Propositional Logic
نویسنده
چکیده
We explain St almarck's proof procedure for classical propo-sitional logic. The method is implemented in a commercial tool that has been used successfully in real industrial veriication projects. Here, we present the proof system underlying the method, and motivate the various design decisions that have resulted in a system that copes well with the large formulas encountered in industrial-scale veriication. We also discuss possible applications in Computer Aided Design of electronic circuits. Abstract. We explain St almarck's proof procedure for classical propo-sitional logic. The method is implemented in a commercial tool that has been used successfully in real industrial veriication projects. Here, we present the proof system underlying the method, and motivate the various design decisions that have resulted in a system that copes well with the large formulas encountered in industrial-scale veriication. We also discuss possible applications in Computer Aided Design of electronic circuits.
منابع مشابه
A Tutorial on Stålmarcks's Proof Procedure for Propositional Logic
We explain St almarck's proof procedure for classical propo-sitional logic. The method is implemented in a commercial tool that has been used successfully in real industrial veriication projects. Here, we present the proof system underlying the method, and motivate the various design decisions that have resulted in a system that copes well with the large formulas encountered in industrial-scale...
متن کاملA Tutorial on the Use of Propositional Logic and St Almarck's Method in System Veriication Part I: Propositional Logic and Simple System Modelling 1 Introduction
We explain the use of propositional logic, and in particular of St almarck's method of propositional proof, in modelling and verifying nite-state reactive systems. One approach to the problem of verifying complex systems is to express both the system and the requirements on the system as logical formulas. Then, veriication comes down to doing a logical proof about some combination of the two fo...
متن کاملSymbolic Model Checking with Sets of States Represented as Formulas
We analyse traditional symbolic model checking BCL + 94] to isolate the operations that a representation for sets of states need to support and present a diierent view, where sets of states are represented by propositional logic formulas. High level algorithms for symbolic model checking based on St almarck's method are then presented, which results in a model checking procedure closely related...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملHow to Prove Properties of Recursively Deened Circuits Using St Almarck's Method
We present a technique for proving properties of recursively deened circuits using St almarck's method. We consider instances of circuits deened according to a particular inductive scheme and show how extra deenitions of fresh propositional variables can be added automatically in such a way that an automatic theorem prover is able to nd short proofs of correctness of the resulting circuits. We ...
متن کامل